On the Meyniel condition for hamiltonicity in bipartite digraphs
نویسندگان
چکیده
We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For a ≥ 2, a strongly connected balanced bipartite digraph D on 2a vertices is hamiltonian if d(u) + d(v) ≥ 3a whenever uv / ∈ A(D) and vu / ∈ A(D). As a consequence, we obtain a sharp sufficient condition for hamiltonicity in terms of the minimal degree: a strongly connected balanced bipartite digraph D on 2a vertices is hamiltonian if δ(D) ≥ 3a/2.
منابع مشابه
Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to deter...
متن کاملQuasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n ? 1), for a digraph of order n to be hamiltonian. Every (k + 1)-quasi-hamiltonian digraph is also k-quasi-hamiltonian; we construct digraphs which are k-quasi-hamiltonian, but not (k + 1)-quasi-hamiltonian. We design an algorithm that checks k-quasi-hamiltonicity of a given digraph with n vertices and m arcs in time O(nm k). We...
متن کاملRemarks on hamiltonian digraphs
An oriented graph is an out-tournament if the out-neighbourhood of every vertex is a tournament. This note is motivated by A. Kemnitz and B. Greger, Congr. Numer. 130 (1998) 127-131. We show that the main result of the paper by Kemnitz and Greger is an easy consequence of the characterization of hamiltonian out-tournaments by Bang-Jensen, Huang and Prisner, J. Combin. Theory Ser. B 59 (1993) 26...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملA Note on a Degree Sum Condition for Long Cycles in Graphs
We conjecture that a 2-connected graph G of order n, in which d(x) + d(y) ≥ n− k for every pair of non-adjacent vertices x and y, contains a cycle of length n − k (k < n/2), unless G is bipartite and n − k is odd. This generalizes to long cycles a well-known degree sum condition for hamiltonicity of Ore. The conjecture is shown to hold for k = 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2014